Minimal Module Extraction from DL-Lite Ontologies Using QBF Solvers
نویسندگان
چکیده
We present a formal framework for (minimal) module extraction based on an abstract notion of inseparability w.r.t. a signature between ontologies. Two instances of this framework are discussed in detail for DL-Lite ontologies: concept inseparability, when ontologies imply the same complex concept inclusions over the signature, and query inseparability, when they give the same answers to existential queries for any instance data over the signature. We demonstrate that different types of corresponding minimal modules for these inseparability relations can be automatically extracted from large-scale DL-Lite ontologies by composing the tractable syntactic locality-based module extraction algorithm with intractable extraction algorithms using the multi-engine QBF solver AQME. The extracted minimal modules are compared with those obtained using non-logic-based approaches.
منابع مشابه
Logic-based ontology comparison and module extraction, with an application to DL-Lite
We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of ‘lightweight’ description logics designed for data-intensive applications. The main feature of our approach is that we take into account the vocabulary (= signature) with respect to which one wants to compare ontologies. Five variants of difference...
متن کاملChecking DL-Lite Modularity with QBF Solvers
We show how the reasoning tasks of checking various versions of conservativity for the description logic DL-Litebool can be reduced to satisfiability of quantified Boolean formulas and how off-the-shelf QBF solvers perform on a number of typical DL-Litebool ontologies.
متن کاملCan You Tell the Difference Between DL-Lite Ontologies?
We develop a formal framework for comparing different versions of DL-Lite ontologies. Four notions of difference and entailment between ontologies are introduced and their applications in ontology development and maintenance discussed. These notions are obtained by distinguishing between differences that can be observed among concept inclusions, answers to queries over ABoxes, and by taking int...
متن کاملLower and Upper Approximations for Depleting Modules of Description Logic Ontologies
It is known that no algorithm can extract the minimal depleting Σ-module from ontologies in expressive description logics (DLs). Thus research has focused on algorithms that approximate minimal depleting modules ‘from above’ by computing a depleting module that is not necessarily minimal. The first contribution of this paper is an implementation (AMEX) of such a depleting module extraction algo...
متن کاملIncosistency-Tolerant Forgetting in DL-lite
In ontology engineering, it is essential to develop techniques for module extraction, ontology reuse and ontology comparison. Since it was introduced in DL-Lite [1], forgetting has become into a major method of extracting modules in DL ontologies. It has been applied in some other domains such as ontology comparison [2]. Given a (consistent) ontology K and a set of concepts and roles F , the re...
متن کامل